Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
double(0) |
→ 0 |
| 2: |
|
double(s(x)) |
→ s(s(double(x))) |
| 3: |
|
x + 0 |
→ x |
| 4: |
|
x + s(y) |
→ s(x + y) |
| 5: |
|
s(x) + y |
→ s(x + y) |
| 6: |
|
double(x) |
→ x + x |
|
There are 4 dependency pairs:
|
| 7: |
|
DOUBLE(s(x)) |
→ DOUBLE(x) |
| 8: |
|
x +# s(y) |
→ x +# y |
| 9: |
|
s(x) +# y |
→ x +# y |
| 10: |
|
DOUBLE(x) |
→ x +# x |
|
The approximated dependency graph contains 2 SCCs:
{8,9}
and {7}.
-
Consider the SCC {8,9}.
There are no usable rules.
By taking the AF π with
π(+#) = 1 together with
the lexicographic path order with
empty precedence,
rule 8
is weakly decreasing and
rule 9
is strictly decreasing.
There is one new SCC.
-
Consider the SCC {8}.
By taking the AF π with
π(+#) = 2 together with
the lexicographic path order with
empty precedence,
rule 8
is strictly decreasing.
-
Consider the SCC {7}.
There are no usable rules.
By taking the AF π with
π(DOUBLE) = 1 together with
the lexicographic path order with
empty precedence,
rule 7
is strictly decreasing.
Hence the TRS is terminating.
Tyrolean Termination Tool (0.01 seconds)
--- May 4, 2006